Splitting the recursive least-squares algorithm

نویسندگان

  • Thomas Magesacher
  • Sven Haar
  • Roland Zukunft
  • Per Ödling
  • Tomas Nordström
  • Per Ola Börjesson
چکیده

Exponentially weighted recursive least-squares (RLS) algorithms are commonly used for fast adaptation. In many cases the input signals are continuous-time. Either a fully analog implementation of the RLS algorithm is applied or the input data are sampled by analog-to-digital (AD) converters to be processed digitally. Although a digital realization is usually the preferred choice, it becomes unfeasible for high-frequency input signals since fast AD converters are needed. This paper proposes a hybrid analog/digital approach essentially allowing the AD conversion rate to be as low as the update-rate of the RLS algorithm. This is basically accomplished by sampling exponentially weighted correlation products instead of the input signals. Furthermore, we propose a mixed-signal filter exactly realizing the exponential weighting according to the cost function. Applying this approach to an interference cancelling problem demonstrates its performance and attractiveness regarding implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving adaptive resolution of analog to digital converters using least squares mean method

This paper presents an adaptive digital resolution improvement method for extrapolating and recursive analog-to-digital converters (ADCs). The presented adaptively enhanced ADC (AE-ADC) digitally estimates the digital equivalent of the input signal by utilizing an adaptive digital filter (ADF). The least mean squares (LMS) algorithm also determines the coefficients of the ADF block. In this sch...

متن کامل

Low Complexity and High speed in Leading DCD ERLS Algorithm

Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...

متن کامل

Matrix Stretching for Sparse

For linear least squares problems minx kAx ? bk2, where A is sparse except for a few dense rows, a straightforward application of Cholesky or QR factorization will lead to a catastrophic ll in the factor R. We consider handling such problems by a matrix stretching technique, where the dense rows are split into several more sparse rows. We develop both a recursive binary splitting algorithm and ...

متن کامل

Application of Recursive Least Squares to Efficient Blunder Detection in Linear Models

In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...

متن کامل

Automated building simplification using a recursive approach

This article presents a new generalization algorithm for automated or semi automated buildings simplification based on the recursive approach. From the data set with a higher level of detail another data set that containing a lower level of detail can be derived. The proposed algorithm has an ability to detect and simplify buildings rotated in random position and does not depend on ordering of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001